Minimizing DET problems

Minimizing Emissions in Integrated Distribution Problems

Minimizing Regret in Dynamic Decision Problems

The menu-dependent nature of regret-minimization creates subtleties in applying regret-minimization to dynamic decision problems. Firstly, it is not clear whether forgone opportunities should be included in the menu. We explain commonly observed behavioral patterns as minimizing regret when forgone opportunities are present, and also show how the treatment of forgone opportunities affects behav...

Minimizing Algebraic Error in Geometric Estimation Problems

This paper gives a widely applicable technique for solving many of the parameter estimation problems encountered in geometric computer vision. A commonly used approach is to minimize an algebraic error function instead of a possibly preferable geometric error function. It is claimed in this paper that minimizing algebraic error will usually give excellent results, and in fact the main problem w...

The Norwegian type-anaphor det

This paper gives a description of the Norwegian type anaphor det ('that') and proposes a formal representation of it in the HPSG framework. This identity-of-sense anaphor is interpreted as referring to a (new) set of entities of the same type as its antecedent. Its antecedent has to be either indefinite or a definite NP that is likely to introduce a brand new discourse referent. Whereas the typ...

Det-extremal cubic bipartite graphs

Let G be a connected k–regular bipartite graph with bipartition V (G) = X ∪Y and adjacency matrix A. We say G is det–extremal if per(A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det–extremal 3–connected cubic bipartite graphs. We extend McCuaig’s result by determining the structure of det–extremal cubic bipartite graphs of conne...